from collections import defaultdict
def walk(x,y,d) :
if d == "N" :y+=1
if d == "S" :y-=1
if d == "E" :x+=1
if d == "W" :x-=1
return (x,y)
def opposite(d):
if d == "N" :return "S"
if d == "S" :return "N"
if d == "E" :return "W"
if d == "W" :return "E"
R = lambda: map(int, input().split())
L = lambda: list(R())
for _ in range(int(input())):
d = defaultdict(set)
x, y = 0, 0
ans = 0
s = input()
for i in s :
if i in d[(x,y)] : ans+=1
else :
d[(x,y)].add(i)
ans+=5
x,y = walk(x,y,i)
d[(x,y)].add(opposite(i))
print(ans)
#include <bits/stdc++.h>
using namespace std;
int main(){
int t;
cin >> t;
while(t--){
string s;
cin >> s;
set<pair<int,int>> se;
int g=0,d=0,p,h;
int ans=0;
for(auto c: s){
p=d;h=g;
if(c=='N')g++;
else if(c=='S')g--;
else if(c=='W')d--;
else d++;
if(!se.count({p+d,h+g})){
ans+=5;
se.insert({p+d,h+g});
}else ans++;
}
cout<<ans<<endl;
}
return 0;
}787. Cheapest Flights Within K Stops | 779. K-th Symbol in Grammar |
701. Insert into a Binary Search Tree | 429. N-ary Tree Level Order Traversal |
739. Daily Temperatures | 647. Palindromic Substrings |
583. Delete Operation for Two Strings | 518. Coin Change 2 |
516. Longest Palindromic Subsequence | 468. Validate IP Address |
450. Delete Node in a BST | 445. Add Two Numbers II |
442. Find All Duplicates in an Array | 437. Path Sum III |
436. Find Right Interval | 435. Non-overlapping Intervals |
406. Queue Reconstruction by Height | 380. Insert Delete GetRandom O(1) |
332. Reconstruct Itinerary | 368. Largest Divisible Subset |
377. Combination Sum IV | 322. Coin Change |
307. Range Sum Query - Mutable | 287. Find the Duplicate Number |
279. Perfect Squares | 275. H-Index II |
274. H-Index | 260. Single Number III |
240. Search a 2D Matrix II | 238. Product of Array Except Self |